Michael Tree

Results: 223



#Item
41Combinators for Bi-Directional Tree Transformations: A Linguistic Approach to the View Update Problem J. Nathan Foster Michael B. Greenwald

Combinators for Bi-Directional Tree Transformations: A Linguistic Approach to the View Update Problem J. Nathan Foster Michael B. Greenwald

Add to Reading List

Source URL: www.cis.upenn.edu

Language: English - Date: 2005-02-13 21:11:53
42Build-a-Tree: Parent-Child Gaming to Learn About Evolution in Museum Settings Krystal Villanosa - Northwestern University, Evanston, IL, USA Florian Block - Harvard University, Cambridge, MA, USA Michael Horn - Northwest

Build-a-Tree: Parent-Child Gaming to Learn About Evolution in Museum Settings Krystal Villanosa - Northwestern University, Evanston, IL, USA Florian Block - Harvard University, Cambridge, MA, USA Michael Horn - Northwest

Add to Reading List

Source URL: tidal.sesp.northwestern.edu

Language: English - Date: 2015-02-21 00:47:12
    432014 IEEE Security and Privacy Workshops  Understanding Insider Threat: A Framework for Characterising Attacks Jason R.C. Nurse† , Oliver Buckley† , Philip A. Legg† , Michael Goldsmith† , Sadie Creese† , Gordon

    2014 IEEE Security and Privacy Workshops Understanding Insider Threat: A Framework for Characterising Attacks Jason R.C. Nurse† , Oliver Buckley† , Philip A. Legg† , Michael Goldsmith† , Sadie Creese† , Gordon

    Add to Reading List

    Source URL: ieee-security.org

    Language: English - Date: 2014-04-30 03:10:27
    441  Transductive Multi-Label Learning via Alpha Matting  Xiang-Nan Kong, Michael K. Ng, and Zhi-Hua Zhou, Senior Member, IEEE

    1 Transductive Multi-Label Learning via Alpha Matting Xiang-Nan Kong, Michael K. Ng, and Zhi-Hua Zhou, Senior Member, IEEE

    Add to Reading List

    Source URL: www.math.hkbu.edu.hk

    Language: English - Date: 2009-12-07 09:24:08
    45Tree Automata over Infinite Alphabets Michael Kaminski and Tony Tan Department of Computer Science, Technion – Israel Institute of Technology, Haifa 32000, Israel {kaminski,tantony}@cs.technion.ac.il Dedicated to Bori

    Tree Automata over Infinite Alphabets Michael Kaminski and Tony Tan Department of Computer Science, Technion – Israel Institute of Technology, Haifa 32000, Israel {kaminski,tantony}@cs.technion.ac.il Dedicated to Bori

    Add to Reading List

    Source URL: alpha.uhasselt.be

    Language: English - Date: 2013-09-27 07:35:34
    46Dynamic Graphs in the Sliding-Window Model? Michael S. Crouch, Andrew McGregor, and Daniel Stubbs University of Massachusetts Amherst 140 Governors Drive, Amherst, MA 01003 {mcc,mcgregor,dstubbs}@cs.umass.edu

    Dynamic Graphs in the Sliding-Window Model? Michael S. Crouch, Andrew McGregor, and Daniel Stubbs University of Massachusetts Amherst 140 Governors Drive, Amherst, MA 01003 {mcc,mcgregor,dstubbs}@cs.umass.edu

    Add to Reading List

    Source URL: people.cs.umass.edu

    Language: English - Date: 2013-06-23 17:01:11
    47GRADES GRADES Coast Redwoods ®

    GRADES GRADES Coast Redwoods ®

    Add to Reading List

    Source URL: education.savetheredwoods.org

    Language: English - Date: 2011-02-17 15:00:43
    48How Tall IS a Redwood? Many coast redwood trees are more than 320 feet tall! Have you ever wondered how big that REALLY is? It can be difficult for us to imagine. Get an idea by measuring your height and then calculating

    How Tall IS a Redwood? Many coast redwood trees are more than 320 feet tall! Have you ever wondered how big that REALLY is? It can be difficult for us to imagine. Get an idea by measuring your height and then calculating

    Add to Reading List

    Source URL: education.savetheredwoods.org

    Language: English - Date: 2013-11-13 14:43:20
    49High Performance Dynamic Lock-Free Hash Tables and List-Based Sets Maged M. Michael IBM Thomas J. Watson Research Center P.O. Box 218 Yorktown Heights NYUSA

    High Performance Dynamic Lock-Free Hash Tables and List-Based Sets Maged M. Michael IBM Thomas J. Watson Research Center P.O. Box 218 Yorktown Heights NYUSA

    Add to Reading List

    Source URL: www.research.ibm.com

    Language: English - Date: 2004-08-02 14:09:15
    50Efficient Noise-Tolerant Learning from Statistical Queries MICHAEL KEARNS AT&T Laboratories—Research, Florham Park, New Jersey  Abstract. In this paper, we study the problem of learning in the presence of classificatio

    Efficient Noise-Tolerant Learning from Statistical Queries MICHAEL KEARNS AT&T Laboratories—Research, Florham Park, New Jersey Abstract. In this paper, we study the problem of learning in the presence of classificatio

    Add to Reading List

    Source URL: www.cs.iastate.edu

    Language: English - Date: 2003-04-11 14:26:30